Refining Abstractions of Hybrid Systems Using Counterexample Fragments
نویسندگان
چکیده
Counterexample guided abstraction refinement, a powerful technique for verifying properties of discrete-state systems, has been extended recently to hybrid systems verification. Unlike in discrete systems, however, establishing the successor relation for hybrid systems can be a fairly expensive step since it requires evaluation and over-approximation of the continuous dynamics. It has been observed that it is often sufficient to consider fragments of counterexamples rather than complete counterexamples. In this paper we further develop the idea of fragments. We extend the notion of cut sets in directed graphs to cutting sets of fragments in abstractions. Cutting sets of fragments are then used to guide the abstraction refinement in order to prove safety properties for hybrid systems.
منابع مشابه
Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement
Hybrid dynamic systems include both continuous and discrete state variables. Properties of hybrid systems, which have an infinite state space, can often be verified using ordinary model checking together with a finite-state abstraction. Model checking can be inconclusive, however, in which case the abstraction must be refined. This paper presents a new procedure to perform this refinement opera...
متن کاملHybrid Automata-based CEGAR for Hybrid Systems
In this paper we present a framework for carrying out counterexample guided abstraction-refinement (CEGAR) for systems modelled as hybrid automata. The main difference, between our approach and previous proposals for CEGAR for hybrid automata, is that we consider the abstractions to be hybrid automata as well. We present a counterexample guided abstraction refinement method for systems modelled...
متن کاملLanguage-Based Abstraction Refinement for Hybrid System Verification
The standard counterexample-guided abstraction-refinement (cegar) approach uses finite transition systems as abstractions of concrete systems. We present an approach to represent and refine abstractions of infinite-state systems that uses regular languages instead of finite transition systems. The advantage of using languages over transition systems is that we can store more fine-grained inform...
متن کاملCoordinated Control for Highly Reconfigurable Systems
Operational semantics of hybrid systems p. 25 SOS methods for semi-algebraic games and optimization p. 54 The discrete time behavior of lazy linear hybrid automata p. 55 Perturbed timed automata p. 70 A homology theory for hybrid systems : hybrid homology p. 86 Observability of switched linear systems in continuous time p. 103 Controller synthesis on non-uniform and uncertain discrete-time doma...
متن کاملCounterexample-guided Abstraction Refinement for Classical Planning Master’s Thesis
Counterexample-guided abstraction refinement (CEGAR) is amethodological framework for incrementally computing abstractions of transition systems. We propose a CEGAR algorithm for computing abstraction heuristics for optimal classical planning. Starting from a coarse abstraction of the planning task, we iteratively compute an optimal abstract solution, check if and why it fails for the concrete ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005